Diverse Palindromic Factorization Is NP-complete
نویسندگان
چکیده
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.
منابع مشابه
Integer factorization and Discrete Logarithm problem are neither in P nor NP-complete
Though integer factorization and discrete logarithm problem are both practically and theoretically important, the computational complexity of these problems remained unknown. By comparing integer factorization problem with a problem in P and NP-complete problems, I show that the decision problem version of integer factorization problem is neither in P nor NP-complete. In addition, integer facto...
متن کاملFactorization and Palindromic Continued Fractions
Abstract We provide elementary explanations in terms of palindromic continued fraction expansions for the factorization of integers of the form a2 + 1, including Fermat numbers and Cunningham project numbers. This provides a generalization and more complete explanation of the factorization of the sixth Fermat number given by Freeman Dyson at the turn of the century. This explanation may provide...
متن کاملMaximal Palindromic Factorization
A palindrome is a symmetric string, phrase, number, or other sequence of units sequence that reads the same forward and backward. We present an algorithm for maximal palindromic factorization of a finite string by adapting an Gusfield algorithm [15] for detecting all occurrences of maximal palindromes in a string in linear time to the length of the given string then using the breadth first sear...
متن کاملDecomposition of Polytopes and Polynomials
Motivated by a connection with the factorization of multivariable polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algori...
متن کاملOn the Ring Isomorphism & Automorphism Problems
We study the complexity of the isomorphism and automorphism problems for finite rings with unity. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of rings. The problem is shown to be in the complexity class AM ∩ coAM and hence is not NP-complete unless the polynomial hierarchy collapses. Integer factorization also reduces to the prob...
متن کامل